Avoiding Permutation Patterns of Type (2, 1) in Compositions
نویسندگان
چکیده
We classify compositions avoiding a single permutation pattern of type (2, 1) according to Wilfequivalence and give the generating function for each of the Wilf classes. 2000 Mathematics Subject Classification: 05A05, 05A15
منابع مشابه
Enumerating Permutations Avoiding a Pair of Babson-steingŕımsson Patterns
Babson and Steingŕımsson introduced generalized permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. Subsequently, Claesson presented a complete solution for the number of permutations avoiding any single pattern of type (1, 2) or (2, 1). For eight of these twelve patterns the answer is given by the Bell numbers. For the rem...
متن کاملEnumerating Permutations Avoiding A Pair Of Babson-Steingrimsson Patterns
Babson and Steingŕımsson introduced generalized permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. Subsequently, Claesson presented a complete solution for the number of permutations avoiding any single pattern of type (1, 2) or (2, 1). For eight of these twelve patterns the answer is given by the Bell numbers. For the rem...
متن کاملPermutations Avoiding a Pair of Generalized Patterns of Length Three with Exactly One Adjacent Pair of Letters
Abstract. In [1] Babson and Steingŕımsson introduced generalized permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. Claesson [2] presented a complete solution for the number of permutations avoiding any single (generalized) pattern of length three with exactly one adjacent pair of letters. For eight of these twelve pattern...
متن کامل. C O ] 1 O ct 2 00 6 PARTIALLY ORDERED PATTERNS AND COMPOSITIONS
A partially ordered (generalized) pattern (POP) is a generalized pattern some of whose letters are incomparable, an extension of generalized permutation patterns introduced by Babson and Steingŕımsson. POPs were introduced in the symmetric group by Kitaev [19, 21], and studied in the set of k-ary words by Kitaev and Mansour [22]. Moreover, Kitaev et al. [23] introduced segmented POPs in composi...
متن کاملN ov 2 00 6 Some statistics on permutations avoiding generalized patterns ∗
In the last decade a huge amount of articles has been published studying pattern avoidance on permutations. From the point of view of enumeration, typically one tries to count permutations avoiding certain patterns according to their lengths. Here we tackle the problem of refining this enumeration by considering the statistics “first/last entry”. We give complete results for every generalized p...
متن کامل